#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int MOD = 1e9 + 7;
const int N = 2010;

int gcd(int a, int b)
{
    return b ? gcd(b, a % b) : a;
}

ll qui(ll a, ll b)
{
    ll res = 1;
    while(b)
    {
        if(b & 1)res = res * a % MOD;
        b >>= 1;
        a = a * a % MOD;
    }
    return res;
}

ll fac[N], inv_fac[N];
ll S[N][N];

void init()
{
    fac[0] = 1;
    for(int i = 1; i < N; i++)
        fac[i] = fac[i - 1] * i % MOD;
    inv_fac[N - 1] = qui(fac[N - 1], MOD - 2);
    for(int i = N - 1; i > 0; i--)
        inv_fac[i - 1] = inv_fac[i] * i % MOD;
    S[0][0] = 1;
    for (int i = 1; i < N; ++i) {
        for (int j = 1; j < N; ++j) {
            S[i][j] = (j * S[i - 1][j] % MOD + S[i - 1][j - 1]) % MOD;
        }
    }
}

ll comb(int a, int b)
{
    return fac[a] * inv_fac[b] % MOD * inv_fac[a - b] % MOD;
}

struct custom_hash {
	static uint64_t splitmix64(uint64_t x) {
		x ^= x << 13;
		x ^= x >> 7;
		x ^= x << 17;
		return x; 
	}
	size_t operator () (uint64_t x) const {
		static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count(); // 时间戳
		return splitmix64(x + FIXED_RANDOM);
	}
};


int main()
{
    int n, q;
    cin >> n >> q;
    int l = 1, r = 2;
    int ans = 0;
    while(q--)
    {
        string op;
        cin >> op;
        int x;
        cin >> x;
        if(op == "L"){
            if(x == l) continue;
            if(l < r){
                if(x > l && x < r){
                    ans += x - l;
                }else if(x < l){
                    ans += l - x;
                }else{
                    ans += (l + n - x);
                }
            }else{
                if(x > r && x < l){
                    ans += l - x;
                }else if(x > l){
                    ans += x - l;
                }else{
                    ans += (x + n - l);
                } 
            }
            l = x;
        }else{
            if(r == x) continue;
            if(l < r){
                if(x > l && x < r){
                    ans += r - x;
                }else if(x > r){
                    ans += x - r;
                }else{
                    ans += (x + n - r);
                }
            }else{
                if(x > r && x < l){
                    ans += x - r;
                }else if(x < r){
                    ans += r - x;
                }else{
                    ans += (r + n - x);
                } 
            }   
            r = x;
        }

    }
    cout << ans << endl;
    return 0;
}